- Indian Journal of Science and Technology
- International Journal of Distributed and Cloud Computing
- International Journal of Computational Intelligence Research
- Wireless Communication
- Software Engineering
- Networking and Communication Engineering
- International Journal of Scientific Engineering and Technology
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Ravichandran, T.
- Intelligent Query Processing in Temporal Database Using Efficient Context Free Grammar
Authors
1 Karpagam University, Coimbatore, Tamil Nadu-641021, IN
2 Hindusthan Institute of Technology, Coimbatore, Tamil Nadu-641032, IN
Source
Indian Journal of Science and Technology, Vol 5, No 6 (2012), Pagination: 2885-2890Abstract
Now a day's interaction with computer become essential, efficient processing, storing and retrieving of data from database will play very important role in the database application. To access the database the user should have a strong knowledge in SQL commands and procedures. The conventional database will give only current data but not past or future data. In this paper we propose an Intelligent Query Processing (IQP) for temporal databases. This will facilitate the novice user to interact temporal database in their native language (English), without using any SQL command or procedures. The main purpose of IQP is for an English sentence to be interpreted by the computer and appropriate action taken. Asking questions to databases in natural language is a very convenient and easy method of data access. The temporal data will support for past, present and future data. In temporal data we used third axis as time interval, which support both transaction time as well valid time. The valid time is the actual or real world time at which the data is valid. This paper proposes the architecture for translating English Query into SQL using efficient context free grammar. This system has been implemented using Java that can be used in any operating system and has been tested with data from the industry domain.Keywords
Intelligent Query Processing, Temporal Database Context Free GrammarReferences
- Abraham T and Roddick JF (1999) Survey of spatiotemporal databases. GeoIn-formatica. 3(1), 61–99.
- Androutsopoulos I, Ritchie G and Thanisch P Masque/sql (1993) A client and portable natural language query interface for relational databases. Database technical paper, Department of AI, University of Edinburgh.
- Gauri Rao, ChanchelAgarwal, SnehalChaudry, NikithaKulkarni and Patel SH (2010) Natural language query processing using semantic grammar. Int. J. Comput. Sci. Eng. Vol 02 No 02 219-223.
- Gauri Rao and Patel SH (2009) Natural language query processing. Int. J. Comput. Appl. Eng. & Technol. & Sci. Vol 6 No. 2 495-505.
- HuangiGuiaogZangi and PhilipC-Y Sheu (2008) A natural language database Interface based on probabilistic context free grammar. IEEE Intl. Workshop on Sematic Comput. & Sys. 155-162.
- Jaymin Patel (2003) Department of computing, Imperial college, University of London M. Eng. Temporal database Sys. Individual Project on 18th June.
- Piero Andrea Bonatti Elisa Bertino and Elena Ferrari Trbac (2001) A temporal role-based access control model. ACM Trans. Information & Sys. Security. 4(3), 191–223.
- Ramasubramanian P and Kannan A (2004) Temporal event matching approach based natural query processing in temporal databases. Int. J. Information Technol. 10(1), 88-100.
- Tansel, Cliord, ShashiGadia, and Richard Snodgrass (1993) Temporal databases: Theory, Design and Implementation. Database Sys. & Appli. Series. Benjamin/Cummings, Redwood City, CA, 2nd ed. 633- 640.
- Tsz Cheng S and Gadia SK (2002) Member IEEE Computer Society The Event Matching Language for Querying Temporal Data. IEEE Trans. Knowledge & Data Engg. 14(5), 1119–1125.
- VijayalakshmiAtluri and Avigdor Gal (2002) An authorization model for temporal and derived data: Securing information portals. ACM Trans. Information & Sys. Security. 5(1), 62–94.
- Winiwarter W and Ismail Khalil Ibrahim (2000) A multilingual natural language interface for ecommerce applications. Ph.D. thesis, University of Vienna, Austria. ACM 26(11):832-843
- A Priority Constrained Pre-emptive Scheduling of Online Real Time Services with Fixed Checkpoint Intervals for Cloud Computing
Authors
1 Department of Computer Science and Engineering, Karpagam University, Coimbatore, Tamil Nadu., IN
2 Hindusthan Institute of Technology, Coimbatore, Tamil Nadu., IN
Source
International Journal of Distributed and Cloud Computing, Vol 1, No 1 (2013), Pagination: 37-41Abstract
In cloud computing, various services are accessed by the different types of clients as pay per use over the internet. This paper presents a new scheduling technique for real time tasks in order to minimize the execution time and focuses on the priority constrained tasks. In older approaches, a non-preemptive scheduling with task migration algorithm is used to schedule the task with highest expected gain and executes the tasks in the queue in a non-preemptive manner. Therefore it increases the execution time of the task and response time of the priority constrained tasks. In order to overcome this problem, a priority constrained pre-emptive scheduling of online real time services with fixed checkpoint intervals is proposed to minimize the execution time of the tasks and improves the overall system performance by giving importance for higher priority tasks. Our simulation results outperform the traditional scheduling algorithms based on the similar model.Keywords
Execution Time, Priority, Deadline, Preemptive, Checkpoint IntervalsReferences
- Weiss, A. (2007). Computing in the clouds. Networker, 11(4), 16–25.
- Singh, D., Singh, J. & Chhabra, A. (2012). Evaluating Overheads of Integrated Multilevel Checkpointing Algorithms in Cloud Computing Environment. International Journal of Computer Network and Information Security, 5(1), 29-38. Published Online June 2012 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijcnis (2012.05.04).
- Burford, D. (2010). Cloud Computing- A Brief Introduction. LAD Enterprizes, Inc.
- Armbrust, M., Fox, A., Griffith, R., Joseph, A. D., Katz, R., Konwinski, A., Lee, G., Patterson, D., Rabkin, A., Stoica, I. & Zaharia, M. (2005). Above the Clouds: A Berkeley View of Cloud Computing. UC Berkeley Technical Report UCB/EECS-2009-28, February 2009.
- Shastry, P. M. M. & Venkatesh, K. (2010). Selection of a Checkpoint Interval in Coordinated Checkpointing Protocol for Fault Tolerant Open MPI. International Journal on Computer Science and Engineering, 2(6), 2064-2070.
- Chtepen, M., Claeys, F. H. A., Dhoedt, B., Turck, F. D. & Demeester, P. (2009). Adaptive Task Checkpointing And Replication: Toward Efficient Fault-Tolerant Grids. IEEE Transactions on Parallel and Distributed Systems, February, 20(2), 180-190.
- Paul, M. & Sanyal, G. (2011). Task-Scheduling in Cloud Computing using Credit Based Assignment Problem. International Journal on Computer Science and Engineering, October, 3(10), 3427-3431.
- Paul, M., Samanta, D. & Sanyal, G. (2011). Dynamic job scheduling in cloud computing based on horizontal load balancing. International Journal of Computer Technology and Application, 2(5), 1552-1556.
- Santhosh, R. & Ravichandran, T. (2012). Non-preemptive on-line scheduling of real-time services with task migration for cloud momputing. European Journal of Scientific Research, October, 89(1), 163-169.
- Santhosh, R. & Ravichandran, T. (2013). Pre-emptive Scheduling of On-line Real Time Services With Task Migration for Cloud Computing. International Conference on Pattern Recognition, Informatics and Mobile Engineering.
- Tayal, S. (2011). Tasks scheduling optimization for the cloud computing system. International Journal of Advanced Engineering Sciences and Technologies, 5(2), 111-115.
- Rao, S., Rao, N. & Kumari, K. (2005-2009). Cloud computing: An overview. Journal of Theoretical and Applied Information Technology, 71-76.
- Suen, T. T. Y. & Wong, J. S. K. (1992). Efficient task migration algorithm for distributed systems. IEEE Transactions on Parallel and Distributed Systems, July, 3(4), 488-499.
- Paindaveine, Y. & Malojicic, D. S. (1996). Process vs Task Migration. Twenty Ninth Hawaii International Conference, (Vol. 1, pp. 636-645).
- Human Language Query Processing in Temporal Database Using Probabilistic Context Free Grammar
Authors
1 Hindusthan Institute of Technology, Tamil Nadu, IN
2 Hindusthan Institute of Technology, Coimbatore, Tamil Nadu, IN
Source
International Journal of Computational Intelligence Research, Vol 8, No 1 (2012), Pagination: 47-58Abstract
Nowadays interaction with computer is vital, effective process and also the storing and retrieving of data from database will play vital role in the database application. To access the Database the user should have a well-built knowledge in SQL command and procedures. But this is not possible for all users. So in this we present Human Language Query Processing for Temporal Database. This will help the novice user to interact Temporal Database in their Native language (English), without using any SQL command or procedures. The conventional Database will give only current data not past or future data. But the Temporal data will support for past, present and future data. In temporal data we used third axis as time interval, which support both Transaction time as well valid time. The valid time is the actual or real world time at which the data is valid. The main aim of this system is that the human language is interpreted with Temporal Database and to produce appropriate results.References
- Gauri Rao, Chanchel Agarwal, Snehal Chaudry, Nikitha Kulkarni and Dr.S.H.Patel Natural Language Query Processing using Semantic Grammar in International Journal on Computer science Engineering, 2010.
- Gauri Rao and Dr.S.H.Patel Natural Language Query Processing in International Journal on Computer Applications in Engineering and Technology and Sciences, 2009.
- Huangi Guiaog Zangi, PhilipC-Y Sheu “A Natural Language Database Interface based on probabilistic context free grammar”, IEEE International workshop on sematic Computing and Systems 2008.
- Ramasubramanian.P and Kannan .A. Temporal Event Matching Approach based Natural Query Processing in Temporal Databases in International Journal of Information Technology, Volume 10, No.1, 2004.
- Jaymin Patel, Department of Computing, Imperial College, University of London MEng Temporal Database System individual Project on18 June 2003.
- Tsz S.Cheng and Shashi. K.Gadia, Member IEEE Computer Society The Event Matching Language for Querying Temporal Data in IEEE Transactions on Knowledge and Data Engineering Volume14 ,No.5 September 2002
- VijayalakshmiAtluri and Avigdor Gal. An authorization model for temporal and derived data: Securing information portals. ACM Transactions on Information and System Security, 5(1):62–94, 2002.
- Piero Andrea Bonatti Elisa Bertino and Elena Ferrari. Trbac: A temporal rolebased access control model. ACM Transactions on Information and System Security, 4(3):191–223, 2001.
- Winiwarter W and Ismail Khalil Ibrahim. A Multilingual Natural Language Interface for Ecommerce Applications. PhD thesis, University of Vienna, Austria, 2000.
- T. Abraham and J. F. Roddick. Survey of Spatio-Temporal Databases.GeoInformatica, 3(1):61–99, March 1999.
- Tansel, Cli_ord, ShashiGadia, and Richard Snodgrass. Temporal Databases: Theory, Design and Implementation. Database Systems and Applications Series. Benjamin/Cummings, Redwood City, CA, second edition, 1993.
- Androutsopoulos I, Ritchie G, and Thanisch P. Masque/sql - a client and portable natural language query interface for relational databases. Database technical paper, Department of AI, University of Edinburgh, 1993.
- Grosz J.B. Team: An experiment in the design of transportable natural language interfaces. Artificial Intelligence, 32:173–243, 1987.
- Anxerre P and Inder R. MASQUE Modular Answering System for Queries in English - User Manual. AI Applications Institute, University of Edinberg, tech. rep. aiai/sr/10 edition, 1986.
- J. F. Allen. Maintaining Knowledge about Temporal Intervals. Communications of the ACM, 26(11):832–843, November 1983.
- To Improve the Performance of Cellular Network by Dynamic Channel Assignment
Authors
1 Anna University of Technology, Coimbatore, IN
2 Hindustan Institute of Technology, Coimbatore, IN
3 Department of ECE, Karpagam University, Coimbatore, IN
Source
Wireless Communication, Vol 4, No 15 (2012), Pagination: 914-917Abstract
Call admission protocols play a central role in determining both the performance of any network, and the revenue of the network. The call admission protocol must decide either to accept the call or reject it. An adaptive call admission control algorithm is proposed here. Mobility management and bandwidth management are two major research issues in a cellular mobile network. Mobility management consists of two basic components: location management and handoff management. To Provide QoS to the users Handoff is a key element in wireless cellular networks. It is often initiated either by crossing a cell boundary or by deterioration in the quality of signal in the current channel. In this paper, a new admission control policy for cellular mobile network is being proposed. Two important QoS parameter in cellular networks are Call Dropping Probability (CDP) and Handoff Dropping Probability (HDP). CDP represents the probability that a call is dropped due to a handoff failure. HDP represents the probability of a handoff failure due to insufficient available resources in the target cell. Most of the algorithms try to limit the HDP to some target maximum but not CDP. In this paper, we show that when HDP is controlled, the CDP is also controlled to a minimum extent while maintaining lower blocking rates for new calls in the system.Keywords
Wireless Cellular Networks, Handoff Dropping Probability, Call Dropping Probability, Resource Allocation, Prioritization Schemes.- 3 Dimensional Geographical IP Traceback Using Direction Ratio Sampling Algorithm (DRSA)
Authors
1 Department of Computer Science Engineering, SNS College of Technology, Sathy Main Road, Coimbatore-641035, Tamil Nadu, IN
2 SNS College of Technology, Sathy Main Road, Coimbatore-641035, IN
3 Hindustan Institute of Technology, Pollachi Main Road, Coimbatore-641032, IN
Source
Software Engineering, Vol 1, No 3 (2009), Pagination: 97-100Abstract
An important and challenging problem is that of tracing DOS/DDOS attack source. Among many IP Traceback schemes, a recent development is DGT (Directed Geographical Traceback). Though multidirectional two dimensional DGT schemes are available, ξξξ in the real scenario, three dimensional, Multidirectional DGT has potential applications. The direction ratio algorithm [DRA] has the limitation of the impossibility of ensuring sufficient unused space in the packet header for the complete DRL (Direction Ratio List) especially when the length of the path is not known apriori. In this paper that limitation is overcome using DRSA (Direction Ratio Sampling Algorithm) which works well for Three dimensional, Multi-Directional, Geographical IP traceback. This approach enables the attack path reconstruction easily possible. In conclusion, DRSA is a robust scheme of attack path reconstruction in geographical traceback.Keywords
DOS (Distributed Denial of Service), DGT (Directional Geographical Traceback), 3DMDGT (Three Dimensional, Multi-Directional Geographical Traceback), DRA (Direction Ratio Algorithm), DRSA (Direction Ratio Sampling Algorithm).- An Investigation of 2 n Direction Geographical Traceback Using Simulation of IP Traceback Strategies
Authors
1 Department of Computer Science Engineering SNS College of Technology, Sathy Main Road, Coimbatore-641035, Tamil Nadu, IN
2 SNS College of Technology, Sathy Main Road, Coimbatore-641035, IN
3 Hindustan Institute of Technology, Pollachi Main Road, Coimbatore-641032, IN
Source
Networking and Communication Engineering, Vol 1, No 3 (2009), Pagination: 110-114Abstract
DoS / DDoS(Distributed Denial of Service) attacks deny regular, internet services accessed by legitimate users, either by blocking the services completely, or by disturbing it completely, so as to cause customer baulking. Several traceback schemes are available to mitigate these attacks. The simulation approach also can be used to test the performing effects of different marking schemes in large-scale DDoS attacks. Based on the simulation and evaluation results, more efficient and effective algorithms, techniques and procedures to combat these attacks may be developed. DGT8, directional geographical trackback scheme, with 8 directions is one of them. Having a limited set of 8 directions, DGT8 may not work for routers with more than 8 interfaces. In this paper, we propose M-DGT i.e DGT 16, a 16 directional geographical traceback scheme having all the advantages of DGT. The 16 directions, though not having exactly equal interface, have nearly equal measures, and are identified using a novel scheme of Segment Direction Ratios (SDR). The SDR concept and the associated marking scheme allow the victim to defend against DDoS attacks independent of its ISP and also the generalization to DGT2n, having 2n directions (n>4).
Keywords
DoS, DDoS, DGT (Directed Geographical Traceback), IP Traceback, SDR (Segment Direction Ratio).- A Smart Device Integrated with an Android for Alerting a Person’s Health Condition: Internet of Things
Authors
1 Department of Information Technology, Jeppiaar Institute of Technology, Chennai – 631604, Tamil Nadu, IN
2 HCL Technologies, Chennai – 600096, Tamil Nadu, IN
3 Department of Electronics and Communication Engineering, SNS College of Technology, Coimbatore – 641035, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 9, No 6 (2016), Pagination:Abstract
Objective: The main objective is to develop a smart device, which is integrated in order to help the aged people during the time of medical emergency situations using Internet of Things (IoT). Methods: The technical methodology implemented is to develop a smart device which works on the basic support of the android application. The device serving people in danger is built using the smart phone applications, Bluetooth transmitter and receiver and microcontroller (Kiel micro vision). Kiel micro vision is an integrated development environment used to create software to be run on embedded system (like a microcontroller). Effective Quality of Service (QoS) is achieved using the concept of IoT. Findings: The concept of IoT is implemented in order to develop an environment which provides a unique way to communicate and transfer data from one end to the other end. The Internet of Things is a new way implementation in the field of medical background, which acts as a media for information retrieval from physical world to digital world, which is enhanced by the support of android platform. Hence the embedded system together constitutes two devices: Stationary device and a Movable device. The Stationary device is inbuilt with an ATMEL Microcontroller, RF Receiver, Bluetooth module, Step-down transformer, an LCD display, Voltage regulator, resistors and Capacitors. The movable device is inbuilt with two buttons along with a RF Transmitter. Application: The smart device for alerting a person’s critical health condition is of good use as it is less expensive and easy to handle, since the people in need are helped in the right time. Moreover this system can also alert our neighborhood even in situations like robbery. The Stationary device which the person is handling can be made as a device attached to human body, say a watch. The size of the device is made smaller, even though the cost becomes higher. Call features also added instead of message feature because everyone looks on text message.Keywords
Android, Bluetooth, Internet of Things, Kiel Micro Vision, RF Transmitter and Receiver, Smart Device- A Study on Graph Theoretical Algorithms in Grid Environment
Authors
1 Odaiyappa College of Engineering and Technology, Theni-31, IN
2 Hindustan Institute of Technology, Coimbatore-32, IN